Tree partition problems with some fixed vertices 固定顶点的树划分问题
In chapter 2 we study two parallel machines scheduling to maximize non - delay jobs . the problem is np - hard for it contains a sub problem equivalent to partition problem 第二章讨论两台平行机排序极大化按期完工工件数问题,由于它的一个子问题等价于划分问题,因而该问题是一个np -难的问题。
In order to further reduce the complexity of super large - scale integration design and enhance graphical readability , a hybrid genetic algorithm for solving circuit partitioning problem was presented 摘要为了进一步降低超大型规模集成电路设计的复杂性、增强图形可读性,提出了一种求解电路划分问题的混合式遗传算法。
In the rest of the thesis , we study approximation algorithms with their worst - case analysis for four different combinatorial optimization problems . in chapter 2 , we consider the optimization versions of the 3 - partitioning and the kernel 3 - partitioning problems 在第二章至第五章中,我们分别研究了四个组合优化问题的近似算法,并给出了它们的性能分析。
In ttg model , task is the base design granularity , the partition of task affect the quality of system design heavily . the thesis addresses the importance of the task partition problem and presents a task partition method based the closeness measurements of system behavior objec1fs Ttg模型中以任务作为设计的基本粒度,本文指出了任务划分问题的重要性,并提出了基于系统行为对象关系度量进行任务划分的方法。